Coalgebraic Modelling : Applications in Automata theory and Modal logic

Rutten, J.J.M.M. [Promotor]Venema, Y. [Copromotor]Kupke, C.A. [Copromotor

Symbolic Synthesis of Mealy Machines from Arithmetic Bistream Functions

In this paper, we describe a symbolic synthesis method which given an algebraic expression that specifies a bitstream function f, constructs a (minimal) Mealy machine that realises f. The synthesis algorithm can be seen as an analogue of Brzozowski’s construction of a finite deterministic automaton from a regular expression. It is based on a coinductive characterisation of the operators of 2-adic arithmetic in terms of stream differential equations.

Planteproduktion og fødevalg

Den overordnede baggrund for projektet var at få nogle kvantitative beskrivelser af, hvorledes man med forskellige former for ekstensiv græsmarksdrift kunne besvare eller øge artsdiversiteten på ferske enge. Samtidig ønskedes at kvantificere konsekvenserne for den landbrugsmæssige produktion på arealerne. Ferske enge varierer meget med hensyn til plantebestand, jordbundsforhold og fugtighed, og det er derfor væsentligt at kende disse faktorer, når man skal vurdere, hvilken produktion, der kan forventes på et givet engareal. Når stude og får afgræsser på halvkulturarealer er der et større udvalg af arter end der er på intensive græsmarker. Desuden er der som regel en lavere belægning, hvilket betyder at dyrene har gode muligheder for at selektere i det planteudbud, der er til rådighed. Målet med denne del af undersøgelsen var at få en beskrivelse af produktionens størrelse, foderkvalitet, artssammensætning, benyttelsens indvirkning på arterne, foderkvaliteten af enkeltarter og studenes fødevalg

Stream differential equations: Specification formats and solution methods

Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich theory partly due to their ubiquity in mathematics and computer science. Stream differential equations are a coinductive method for specifying streams and stream operations, and their theory has been developed in many papers over the past two decades. In this paper we present a survey of the many results in this area. Our focus is on the classification of different formats of stream differential equations, their solution methods, and the classes of streams they can define. Moreover, we describe in detail the connection between the so-called syntactic solution method and abstract GSOS

Stream Differential Equations: Specification Formats and Solution Methods

Streams, or innite sequences, are innite objects of a very simple type, yet they have a rich theory partly due to their ubiquity in mathematics and computer science. Stream dierential equations are a coinductive method for specifying streams and stream operations, and their theory has been developed in many papers over the past two decades. In this paper we present a survey of the many results in this area. Our focus is on the classication of dierent formats of stream dierential equations, their solution methods, and the classes of streams they can dene. Moreover, we describe in detail the connection between the so-called syntactic solution method and abstract GSOS

Neighbourhood contingency bisimulation

We introduce a notion of bisimulation for contingency logic interpreted on neighbourhood structures, characterise this logic as bisimulation-invariant fragment of modal logic and of first-order logic, and compare it with existing notions in the literature